Accurate and compact stochastic computations by exploiting correlation
نویسندگان
چکیده
منابع مشابه
Learning Accurate Cutset Networks by Exploiting Decomposability
The rising interest around tractable Probabilistic Graphical Models is due to the guarantees on inference feasibility they provide. Among them, Cutset Networks (CNets) have recently been introduced as models embedding Pearl’s cutset conditioning algorithm in the form of weighted probabilistic model trees with tree-structured models as leaves. Learning the structure of CNets has been tackled as ...
متن کاملExploiting Coherence in Lighting and Shading Computations
Computing global illumination (GI) in virtual scenes becomes increasingly attractive even for real-time applications nowadays. GI delivers important cues in the perception of 3D virtual scenes, which is important for material and architectural design. Therefore, for photo-realistic rendering in the design and even the game industry, GI has become indispensable. While the computer simulation of ...
متن کاملDetecting and Exploiting Narrow Bitwidth Computations
Many important applications perform computations on non-standard bit-width values; mapping them to word-based processing units is wasteful of resources and results in suboptimal performance. While there are some processor architecture innovations which take advantage of varying bit-widths, compiler optimizations lag far behind. We present a compiler algorithm which infers minimal widths and con...
متن کاملFast, Robust and Accurate Digital Image Correlation Calculation Without Redundant Computations
High-efficiency and high-accuracy deformation analysis using digital image correlation (DIC) has become increasingly important in recent years, considering the ongoing trend of using higher resolution digital cameras and common requirement of processing a large sequence of images recorded in a dynamic testing. In this work, to eliminate the redundant computations involved in conventional DIC me...
متن کاملExploiting Locality on Parallel Sparse Matrix Computations
By now, irregular problems are di cult to parallelize in an automatic way because of their lack of regularity in data access patterns. Most times, programmers must hand-write a particular solution for each problem separately. In this paper we present two pseudo-regular distributions which can be applied to partition most problems achieving very good average case distributions. Also, we have des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES
سال: 2019
ISSN: 1303-6203
DOI: 10.3906/elk-1805-195